Properties of factorizations with successive lengths in One-dimensional local domains
نویسندگان
چکیده
منابع مشابه
Transmission properties of one dimensional fractal structures
In this paper, the optical properties of one dimensional fractal structures are investigated. We consider six typical fractal photonic structures: the symmetric dual cantor-like fractal structure, the asymmetric dual cantor-like fractal structure, the single cantor-like fractal structure, the symmetric dual golden-section fractal structure, the asymmetric dual golden-section fractal structure a...
متن کاملPhase Properties of One-Dimensional Quaternary Photonic Crystals
In this paper, properties of reflection phase in one-dimensional quaternary photonic crystals combining dispersive meta-materials and positive index materials are investigated by transfer matrix method. Two omnidirectional band gaps are located in the band structure of considered structure. However, we limit our studies to the frequency range of the second wide band gap. We observe that the val...
متن کاملSuccessive Rank-Revealing Cholesky Factorizations on GPUs
We present an algorithm and its GPU implementation for fast generation of rank-revealing Cholesky factors {Rk} at output in response to a sequence of data matrices {Ak} at input. The Cholesky factors are subsequently used for calculating adaptive weight vectors as control feedback in space-time adaptive processing (STAP) and sensing systems [3]. The size of the input data matrices is m× n, wher...
متن کاملAnalytical Localization Lengths in an One-Dimensional Disordered Electron System
Analytical approximations of the Lyapunov exponent are derived for a random displacement model with equal potential barriers and random positions of the scatterers. Two asymptotic regions are considered corresponding to high and low reflectivity of the single scattering potential. The analytical results are in terms of a distribution functionW for certain phases of the transfer matrices. A func...
متن کاملDiscretization Errors Associated with Reproducing Kernel Methods: One-Dimensional Domains
The Reproducing Kernel Particle Method (RKPM) is a discretization technique for partial di erential equations that uses the method of weighted residuals to produce either \mesh-free" or \mesh-full" methods. The technique employs classical reproducing kernel theory and incorporates modi ed kernels to account for inconsistencies arising from the (unavoidable) introduction of discrete integration ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Commutative Algebra
سال: 2009
ISSN: 1939-2346
DOI: 10.1216/jca-2009-1-2-237